from bisect import bisect_left
from sys import stdin
input = stdin.buffer.readline
def func():
index = [i+1 for i in range(n) if i+1 > a[i]]
count = sum(bisect_left(index, a[index[i]-1]) for i in range(len(index)))
print(count)
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
func()
#include <bits/stdc++.h>
using namespace std;
#define gogo ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const string YES = "YES";
const string NO = "NO";
template <typename T>
class BIT {
public:
vector<T> c;
int n;
BIT(int _n) : n(_n) {
c.resize(n);
}
void modify(int x, T v) {
while (x < n) {
c[x] += v;
x |= (x + 1);
}
}
T query(int x) {
T v{};
while (x >= 0) {
v += c[x];
x = (x & (x + 1)) - 1;
}
return v;
}
T get(int l, int r) {
return get(r) - get(l - 1);
}
};
void run() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1;i <= n;i ++)
cin >> a[i];
BIT<int> c(n + 1);
long long ans = 0;
for (int i = 1;i <= n;i ++) {
if (a[i] < i) {
//cout << "zzzz" << c.query(a[i] - 1) << endl;
if (a[i] - 1> 0) ans += c.query(a[i] - 1);
c.modify(i, 1);
}
}
cout << ans << endl;
}
int32_t main() {
gogo;
int tt;
cin >> tt;
while (tt --)
run();
return 0;
}238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |